Some Combinatorics Related to Central Binomial Coefficients: Grand-Dyck Paths, Coloured Noncrossing Partitions and Signed Pattern Avoiding Permutations
نویسنده
چکیده
We give some interpretations to certain integer sequences in terms of parameters on Grand-Dyck paths and coloured noncrossing partitions, and we find some new bijections relating Grand-Dyck paths and signed pattern avoiding permutations. Next we transfer a natural distributive lattice structure on Grand-Dyck paths to coloured noncrossing partitions and signed pattern avoiding permutations, thus showing, in particular, that it is isomorphic to the structure induced by the (strong) Bruhat order on a certain set of signed pattern avoiding permutations.
منابع مشابه
Restricted Dumont permutations, Dyck paths, and noncrossing partitions
We complete the enumeration of Dumont permutations of the second kind avoiding a pattern of length 4 which is itself a Dumont permutation of the second kind. We also consider some combinatorial statistics on Dumont permutations avoiding certain patterns of length 3 and 4 and give a natural bijection between 3142-avoiding Dumont permutations of the second kind and noncrossing partitions that use...
متن کاملSome order-theoretic properties of the Motzkin and Schröder families∗
Our starting point is one of the main results of [BBFP], which we are going to recall in the next lines. Denote by Dn, NC(n) and Sn(312) the sets of Dyck paths of length 2n, noncrossing partitions of [1, n] and 312-avoiding permutations of [1, n], respectively, where [1, n] is the set of positive integers less than or equal to n. For our purposes, the following notations will be particularly us...
متن کاملPairs of noncrossing free Dyck paths and noncrossing partitions
Using the bijection between partitions and vacillating tableaux, we establish a correspondence between pairs of noncrossing free Dyck paths of length 2n and noncrossing partitions of [2n + 1] with n + 1 blocks. In terms of the number of up steps at odd positions, we find a characterization of Dyck paths constructed from pairs of noncrossing free Dyck paths by using the Labelle merging algorithm.
متن کاملEnumeration of snakes and cycle-alternating permutations
Springer numbers are analogs of Euler numbers for the group of signed permutations. Arnol’d showed that they count some objects called snakes, which generalize alternating permutations. Hoffman established a link between Springer numbers, snakes, and some polynomials related with the successive derivatives of trigonometric functions. The goal of this article is to give further combinatorial pro...
متن کاملSchröder Paths and Pattern Avoiding Partitions Sherry
In this paper, we show that both 12312-avoiding partitions and 12321-avoiding partitions of the set [n + 1] are in one-to-one correspondence with Schröder paths of semilength n without peaks at even level. As a consequence, the refined enumeration of 12312-avoiding (resp. 12321-avoiding) partitions according to the number of blocks can be reduced to the enumeration of certain Schröder paths acc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Graphs and Combinatorics
دوره 26 شماره
صفحات -
تاریخ انتشار 2010